Parametric Computation Tree Logic with Knowledge

نویسندگان

  • A. V. Jones
  • A. Lomuscio
  • M. Knapik
  • W. Penczek
چکیده

We present a certain extension of temporal-epistemic logic CTLK, allowing for specification of parametric group knowledge properties. These properties allow for free variables, and we introduce a technique for synthesizing all the possible variable substitutions which make the given formula hold in a model. We present the relevant theory, and demonstrate the efficiency and practical usefulness of our approach by performing the parametric analysis of several properties of the IEEE 802.5 token ring LAN protocol with some faults injected.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounded Parametric Verification for Distributed Time Petri Nets with Discrete-Time Semantics

Bounded Model Checking (BMC) is an efficient technique applicable to verification of temporal properties of (timed) distributed systems. In this paper we show for the first time how to apply BMC to parametric verification of time Petri nets with discrete-time semantics. The properties are expressed by formulas of the logic PRTECTL a parametric extension of the existential fragment of Computatio...

متن کامل

Parametric Markov Chains: PCTL Complexity and Fraction-free Gaussian Elimination

Parametric Markov chains have been introduced as a model for families of stochastic systems that rely on the same graph structure, but differ in the concrete transition probabilities. The latter are specified by polynomial constraints for the parameters. Among the tasks typically addressed in the analysis of parametric Markov chains are (1) the computation of closed-form solutions for reachabil...

متن کامل

Parametric Quantitative Temporal Reasoning

We deene Parameterized Real-Time Computation Tree Logic (PRTCTL), which allows quantitative temporal speciications to be parameterized over the natural numbers. Parameterized quantitative speciications are quantitative speciications in which concrete timing information has been abstracted away. Such abstraction allows designers to specify quantitative restrictions on the temporal ordering of ev...

متن کامل

Optimal intelligent control for glucose regulation

This paper introduces a novel control methodology based on fuzzy controller for a glucose-insulin regulatory system of type I diabetes patient. First, in order to incorporate knowledge about patient treatment, a fuzzy logic controller is employed for regulating the gains of the basis Proportional-Integral (PI) as a self-tuning controller. Then, to overcome the key drawback of fuzzy logic contro...

متن کامل

Deriving Parameter Conditions for Periodic Timed Automata Satisfying Real-Time Temporal Logic Formulas

A symbolic model checking method for parametric periodic timed automata is proposed. The method derives symbolically the weakest condition for parameters such that the specified control state of a periodic timed automaton satisfies some temporal properties. Unlike several existing parametric symbolic model checking methods, the proposed method is ‘on-the-fly’ — it does not unnecessarily check a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011